Efficient updates within a dispersed storage network

ABSTRACT

A method includes determining that a dispersed data source is to be updated. The method further includes determining whether the update to the dispersed data source can be delayed. When the update to the dispersed data source can be delayed, the method further includes determining whether another update is pending for the dispersed data source. When the other update is pending, the method further includes determining whether processing efficiency of aggregating the update and the other update equals or exceeds an update processing efficiency threshold. When the processing efficiency of aggregating the update and the other update equals or exceeds the update processing efficiency threshold, the method further includes performing an aggregate update to the dispersed data source for the update and the other update. When the update to the dispersed data source cannot be delayed, the method further includes processing the update to produce an updated dispersed data source.

STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT

Not Applicable

INCORPORATION-BY-REFERENCE OF MATERIAL SUBMITTED ON A COMPACT DISC

Not applicable.

BACKGROUND OF THE INVENTION Technical Field of the Invention

This invention relates generally to computer networks and more particularly to dispersing error encoded data.

Description of Related Art

Computing devices are known to communicate data, process data, and/or store data. Such computing devices range from wireless smart phones, laptops, tablets, personal computers (PC), work stations, and video game devices, to data centers that support millions of web searches, stock trades, or on-line purchases every day. In general, a computing device includes a central processing unit (CPU), a memory system, user input/output interfaces, peripheral device interfaces, and an interconnecting bus structure.

As is further known, a computer may effectively extend its CPU by using “cloud computing” to perform one or more computing functions (e.g., a service, an application, an algorithm, an arithmetic logic function, etc.) on behalf of the computer. Further, for large services, applications, and/or functions, cloud computing may be performed by multiple cloud computing resources in a distributed manner to improve the response time for completion of the service, application, and/or function. For example, Hadoop is an open source software framework that supports distributed applications enabling application execution by thousands of computers.

In addition to cloud computing, a computer may use “cloud storage” as part of its memory system. As is known, cloud storage enables a user, via its computer, to store files, applications, etc. on an Internet storage system. The Internet storage system may include a RAID (redundant array of independent disks) system and/or a dispersed storage system that uses an error correction scheme to encode data for storage.

In a dispersed storage system, almost all, if not all of the data and associated metadata (e.g., information about how, where, when, what, and/or by who the data was stored), is error encoded as stored in the system. Many times within the system, a dispersed storage (DS) processing unit receives requests to update the data and/or the associated metadata. Performing each update operation individually can be expensive. For example, the update may require a small change to the data and/or the associated metadata but, to perform the update, the DS processing unit has to retrieve the encoded data and/or encoded metadata, reconstruct it, make the change, re-encode the changed data and/or associated metadata, and send it for storage.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWING(S)

FIG. 1 is a schematic block diagram of an embodiment of a dispersed or distributed storage network (DSN) in accordance with the present invention;

FIG. 2 is a schematic block diagram of an embodiment of a computing core in accordance with the present invention;

FIG. 3 is a schematic block diagram of an example of dispersed storage error encoding of data in accordance with the present invention;

FIG. 4 is a schematic block diagram of a generic example of an error encoding function in accordance with the present invention;

FIG. 5 is a schematic block diagram of a specific example of an error encoding function in accordance with the present invention;

FIG. 6 is a schematic block diagram of an example of a slice name of an encoded data slice (EDS) in accordance with the present invention;

FIG. 7 is a schematic block diagram of an example of dispersed storage error decoding of data in accordance with the present invention;

FIG. 8 is a schematic block diagram of a generic example of an error decoding function in accordance with the present invention;

FIG. 9 is a schematic block diagram of an embodiment of the DSN memory in accordance with the present invention; and

FIG. 10 is a logic diagram of an example of a method of efficient updating within the DSN in accordance with the present invention.

DETAILED DESCRIPTION OF THE INVENTION

FIG. 1 is a schematic block diagram of an embodiment of a dispersed, or distributed, storage network (DSN) 10 that includes a plurality of computing devices 12-16, a managing unit 18, an integrity processing unit 20, and a DSN memory 22. The components of the DSN 10 are coupled to a network 24, which may include one or more wireless and/or wire lined communication systems; one or more non-public intranet systems and/or public internet systems; and/or one or more local area networks (LAN) and/or wide area networks (WAN).

The DSN memory 22 includes a plurality of storage units 36 that may be located at geographically different sites (e.g., one in Chicago, one in Milwaukee, etc.), at a common site, or a combination thereof. For example, if the DSN memory 22 includes eight storage units 36, each storage unit is located at a different site. As another example, if the DSN memory 22 includes eight storage units 36, all eight storage units are located at the same site. As yet another example, if the DSN memory 22 includes eight storage units 36, a first pair of storage units are at a first common site, a second pair of storage units are at a second common site, a third pair of storage units are at a third common site, and a fourth pair of storage units are at a fourth common site. Note that a DSN memory 22 may include more or less than eight storage units 36. Further note that each storage unit 36 includes a computing core (as shown in FIG. 2, or components thereof) and a plurality of memory devices for storing dispersed error encoded data.

Each of the computing devices 12-16, the managing unit 18, and the integrity processing unit 20 include a computing core 26, which includes network interfaces 30-33. Computing devices 12-16 may each be a portable computing device and/or a fixed computing device. A portable computing device may be a social networking device, a gaming device, a cell phone, a smart phone, a digital assistant, a digital music player, a digital video player, a laptop computer, a handheld computer, a tablet, a video game controller, and/or any other portable device that includes a computing core. A fixed computing device may be a computer (PC), a computer server, a cable set-top box, a satellite receiver, a television set, a printer, a fax machine, home entertainment equipment, a video game console, and/or any type of home or office computing equipment. Note that each of the managing unit 18 and the integrity processing unit 20 may be separate computing devices, may be a common computing device, and/or may be integrated into one or more of the computing devices 12-16 and/or into one or more of the storage units 36.

Each interface 30, 32, and 33 includes software and hardware to support one or more communication links via the network 24 indirectly and/or directly. For example, interface 30 supports a communication link (e.g., wired, wireless, direct, via a LAN, via the network 24, etc.) between computing devices 14 and 16. As another example, interface 32 supports communication links (e.g., a wired connection, a wireless connection, a LAN connection, and/or any other type of connection to/from the network 24) between computing devices 12 and 16 and the DSN memory 22. As yet another example, interface 33 supports a communication link for each of the managing unit 18 and the integrity processing unit 20 to the network 24.

Computing devices 12 and 16 include a dispersed storage (DS) client module 34, which enables the computing device to dispersed storage error encode and decode data (e.g., data object 40) as subsequently described with reference to one or more of FIGS. 3-8. In this example embodiment, computing device 16 functions as a dispersed storage processing agent for computing device 14. In this role, computing device 16 dispersed storage error encodes and decodes data on behalf of computing device 14. With the use of dispersed storage error encoding and decoding, the DSN 10 is tolerant of a significant number of storage unit failures (the number of failures is based on parameters of the dispersed storage error encoding function) without loss of data and without the need for a redundant or backup copies of the data. Further, the DSN 10 stores data for an indefinite period of time without data loss and in a secure manner (e.g., the system is very resistant to unauthorized attempts at accessing the data).

In operation, the managing unit 18 performs DS management services. For example, the managing unit 18 establishes distributed data storage parameters (e.g., vault creation, distributed storage parameters, security parameters, billing information, user profile information, etc.) for computing devices 12-14 individually or as part of a group of user devices. As a specific example, the managing unit 18 coordinates creation of a vault (e.g., a virtual memory block associated with a portion of an overall namespace of the DSN) within the DSN memory 22 for a user device, a group of devices, or for public access and establishes per vault dispersed storage (DS) error encoding parameters for a vault. The managing unit 18 facilitates storage of DS error encoding parameters for each vault by updating registry information of the DSN 10, where the registry information may be stored in the DSN memory 22, a computing device 12-16, the managing unit 18, and/or the integrity processing unit 20.

The managing unit 18 creates and stores user profile information (e.g., an access control list (ACL)) in local memory and/or within memory of the DSN memory 22. The user profile information includes authentication information, permissions, and/or the security parameters. The security parameters may include encryption/decryption scheme, one or more encryption keys, key generation scheme, and/or data encoding/decoding scheme.

The managing unit 18 creates billing information for a particular user, a user group, a vault access, public vault access, etc. For instance, the managing unit 18 tracks the number of times a user accesses a non-public vault and/or public vaults, which can be used to generate a per-access billing information. In another instance, the managing unit 18 tracks the amount of data stored and/or retrieved by a user device and/or a user group, which can be used to generate a per-data-amount billing information.

As another example, the managing unit 18 performs network operations, network administration, and/or network maintenance. Network operations includes authenticating user data allocation requests (e.g., read and/or write requests), managing creation of vaults, establishing authentication credentials for user devices, adding/deleting components (e.g., user devices, storage units, and/or computing devices with a DS client module 34) to/from the DSN 10, and/or establishing authentication credentials for the storage units 36. Network administration includes monitoring devices and/or units for failures, maintaining vault information, determining device and/or unit activation status, determining device and/or unit loading, and/or determining any other system level operation that affects the performance level of the DSN 10. Network maintenance includes facilitating replacing, upgrading, repairing, and/or expanding a device and/or unit of the DSN 10.

The integrity processing unit 20 performs rebuilding of ‘bad’ or missing encoded data slices. At a high level, the integrity processing unit 20 performs rebuilding by periodically attempting to retrieve/list encoded data slices, and/or slice names of the encoded data slices, from the DSN memory 22. For retrieved encoded slices, they are checked for errors due to data corruption, outdated version, etc. If a slice includes an error, it is flagged as a ‘bad’ slice. For encoded data slices that were not received and/or not listed, they are flagged as missing slices. Bad and/or missing slices are subsequently rebuilt using other retrieved encoded data slices that are deemed to be good slices to produce rebuilt slices. The rebuilt slices are stored in the DSN memory 22.

FIG. 2 is a schematic block diagram of an embodiment of a computing core 26 that includes a processing module 50, a memory controller 52, main memory 54, a video graphics processing unit 55, an input/output (IO) controller 56, a peripheral component interconnect (PCI) interface 58, an IO interface module 60, at least one IO device interface module 62, a read only memory (ROM) basic input output system (BIOS) 64, and one or more memory interface modules. The one or more memory interface module(s) includes one or more of a universal serial bus (USB) interface module 66, a host bus adapter (HBA) interface module 68, a network interface module 70, a flash interface module 72, a hard drive interface module 74, and a DSN interface module 76.

The DSN interface module 76 functions to mimic a conventional operating system (OS) file system interface (e.g., network file system (NFS), flash file system (FFS), disk file system (DFS), file transfer protocol (FTP), web-based distributed authoring and versioning (WebDAV), etc.) and/or a block memory interface (e.g., small computer system interface (SCSI), internet small computer system interface (iSCSI), etc.). The DSN interface module 76 and/or the network interface module 70 may function as one or more of the interface 30-33 of FIG. 1. Note that the IO device interface module 62 and/or the memory interface modules 66-76 may be collectively or individually referred to as IO ports.

FIG. 3 is a schematic block diagram of an example of dispersed storage error encoding of data. When a computing device 12 or 16 has data to store it disperse storage error encodes the data in accordance with a dispersed storage error encoding process based on dispersed storage error encoding parameters. The dispersed storage error encoding parameters include an encoding function (e.g., information dispersal algorithm, Reed-Solomon, Cauchy Reed-Solomon, systematic encoding, non-systematic encoding, on-line codes, etc.), a data segmenting protocol (e.g., data segment size, fixed, variable, etc.), and per data segment encoding values. The per data segment encoding values include a total, or pillar width, number (T) of encoded data slices per encoding of a data segment (i.e., in a set of encoded data slices); a decode threshold number (D) of encoded data slices of a set of encoded data slices that are needed to recover the data segment; a read threshold number (R) of encoded data slices to indicate a number of encoded data slices per set to be read from storage for decoding of the data segment; and/or a write threshold number (W) to indicate a number of encoded data slices per set that must be accurately stored before the encoded data segment is deemed to have been properly stored. The dispersed storage error encoding parameters may further include slicing information (e.g., the number of encoded data slices that will be created for each data segment) and/or slice security information (e.g., per encoded data slice encryption, compression, integrity checksum, etc.).

In the present example, Cauchy Reed-Solomon has been selected as the encoding function (a generic example is shown in FIG. 4 and a specific example is shown in FIG. 5); the data segmenting protocol is to divide the data object into fixed sized data segments; and the per data segment encoding values include: a pillar width of 5, a decode threshold of 3, a read threshold of 4, and a write threshold of 4. In accordance with the data segmenting protocol, the computing device 12 or 16 divides the data (e.g., a file (e.g., text, video, audio, etc.), a data object, or other data arrangement) into a plurality of fixed sized data segments (e.g., 1 through Y of a fixed size in range of Kilo-bytes to Tera-bytes or more). The number of data segments created is dependent of the size of the data and the data segmenting protocol.

The computing device 12 or 16 then disperse storage error encodes a data segment using the selected encoding function (e.g., Cauchy Reed-Solomon) to produce a set of encoded data slices. FIG. 4 illustrates a generic Cauchy Reed-Solomon encoding function, which includes an encoding matrix (EM), a data matrix (DM), and a coded matrix (CM). The size of the encoding matrix (EM) is dependent on the pillar width number (T) and the decode threshold number (D) of selected per data segment encoding values. To produce the data matrix (DM), the data segment is divided into a plurality of data blocks and the data blocks are arranged into D number of rows with Z data blocks per row. Note that Z is a function of the number of data blocks created from the data segment and the decode threshold number (D). The coded matrix is produced by matrix multiplying the data matrix by the encoding matrix.

FIG. 5 illustrates a specific example of Cauchy Reed-Solomon encoding with a pillar number (T) of five and decode threshold number of three. In this example, a first data segment is divided into twelve data blocks (D1-D12). The coded matrix includes five rows of coded data blocks, where the first row of X11-X14 corresponds to a first encoded data slice (EDS 1_1), the second row of X21-X24 corresponds to a second encoded data slice (EDS 2_1), the third row of X31-X34 corresponds to a third encoded data slice (EDS 3_1), the fourth row of X41-X44 corresponds to a fourth encoded data slice (EDS 4_1), and the fifth row of X51-X54 corresponds to a fifth encoded data slice (EDS 5_1). Note that the second number of the EDS designation corresponds to the data segment number.

Returning to the discussion of FIG. 3, the computing device also creates a slice name (SN) for each encoded data slice (EDS) in the set of encoded data slices. A typical format for a slice name 80 is shown in FIG. 6. As shown, the slice name (SN) 80 includes a pillar number of the encoded data slice (e.g., one of 1-T), a data segment number (e.g., one of 1-Y), a vault identifier (ID), a data object identifier (ID), and may further include revision level information of the encoded data slices. The slice name functions as, at least part of, a DSN address for the encoded data slice for storage and retrieval from the DSN memory 22.

As a result of encoding, the computing device 12 or 16 produces a plurality of sets of encoded data slices, which are provided with their respective slice names to the storage units for storage. As shown, the first set of encoded data slices includes EDS 1_1 through EDS 5_1 and the first set of slice names includes SN 1_1 through SN 5_1 and the last set of encoded data slices includes EDS 1_Y through EDS 5_Y and the last set of slice names includes SN 1_Y through SN 5_Y.

FIG. 7 is a schematic block diagram of an example of dispersed storage error decoding of a data object that was dispersed storage error encoded and stored in the example of FIG. 4. In this example, the computing device 12 or 16 retrieves from the storage units at least the decode threshold number of encoded data slices per data segment. As a specific example, the computing device retrieves a read threshold number of encoded data slices.

To recover a data segment from a decode threshold number of encoded data slices, the computing device uses a decoding function as shown in FIG. 8. As shown, the decoding function is essentially an inverse of the encoding function of FIG. 4. The coded matrix includes a decode threshold number of rows (e.g., three in this example) and the decoding matrix in an inversion of the encoding matrix that includes the corresponding rows of the coded matrix. For example, if the coded matrix includes rows 1, 2, and 4, the encoding matrix is reduced to rows 1, 2, and 4, and then inverted to produce the decoding matrix.

FIG. 9 is a schematic block diagram of an embodiment of the DSN memory 22 that includes a plurality of storage units 36. The storage units 36 are arranged into sets of storage units. In this example, a set of storage units includes five storage units, but may include more or less than five. Further, from set to set, the number of storage units included in a set may vary.

As is shown, one or more of the sets of storage units is logically divided into storage regions. For example, set 1 is divided into logical storage regions 1_1 through 1_k and set x is divided into regions x_1 through x_N. Within each storage unit, a region's logical memory space corresponds to one or more memory devices within the storage unit or to some other logical to physical memory space mapping. The regions allow for efficient bulk data access requests (e.g., reads, writes, status check, listing, etc.).

For example, a large data object is divided into data partitions, and each data partition is divided into a plurality of data segments. Each of the pluralities of data segment is dispersed storage error encoded to produce pluralities of sets of encoded data slices. One plurality of sets of encoded data slices is stored in one region, a second plurality of sets of encoded data slices is stored in a second region, and so on.

To track where the plurality of sets of encoded data slices are stored, one or more computing devices of the DSN (e.g., any one or more of devices 12-20 of FIG. 1) accesses a regional header object 100, which includes a visible region section 102 and an open transaction section 104. The region header object 100 is stored within the DSN memory 22 as one or more sets of encoded header slices. As such, any change to the region header object requires the slices to be retrieved, the region header object reconstructed, the change made, the updated region header object to be re-encoded, and the re-encoded slices to be stored in the DSN memory. Co-pending patent application entitled, “MAPPING STORAGE OF DATA IN A DISPERSED STORAGE NETWORK”, having a filing date of Nov. 25, 2013, and a serial number of Ser. No. 14/088,897 describes region header objects in greater detail and is incorporated herein in its entirety.

To assist in finding particular data objects, one or more computing devices of the DSN accesses an index structure 90, which includes a plurality of hierarchically nodes 92-98. In general, a data object has certain attributes assigned to it (e.g., email, information about person X, a date, a data object type (photo, news article, etc.), and/or other information useful in describing and/or identifying the data object). Through the indexing structure and based on the attributes, addresses for the pluralities of sets of encoded data slices of a data object can be found.

The index structure 90 is stored within the DSN memory 22 as one or more sets of encoded index slices. As such, any change to the any of the nodes requires the slices, or at least some of them, to be retrieved, the index structure, or a portion thereof, reconstructed, the change made, the updated index structure, or portion thereof, to be re-encoded, and the re-encoded slices to be stored in the DSN memory. Co-pending patent application entitled, “RETRIEVING DATA UTILIZING A DISTRIBUTED INDEX”, having a filing date of Dec. 18, 2012, and a serial number of Ser. No. 13/718,961 describes an indexing structure in greater detail and is incorporated herein in its entirety.

To further assist in access data objects, one or more computing devices of the DSN accesses metadata 105 regarding the pluralities of sets of encoded data slices. As used herein, the associated metadata 105 includes information for a data object regarding how the data object was encoded, where the slices are stored or to be stored, when the data object was encoded, what attributes of the data object are relevant, what entity originated the data object, what entity or entities can access it, and/or what entity (e.g., computing device) encoded the data object. As an example, the metadata be a directory, is a distributed agreement protocol, and/or other data storing mapping protocol.

Often times, an update to the data object, to one or more sets of encoded data slices, to the region header object 100, to the index structure 90, to slices names of the encoded slices, and/or to the metadata 105 (individually and/or collectively referred to as a data source and/or as a dispersed data source) is a rather minor change. For example, an update includes a change to a region in which a plurality of sets of encoded data slices are stored. As another example, an update includes a change to one set (or a few sets) of encoded data slices of the encoded data object. As another example, the update includes a change to a node (or a few nodes) of the index structure. As yet another example, the update includes a change to the metadata (e.g., add or delete an attribute, extend access privileges, etc.)

When the update is of a nature that does not require immediate processing (e.g., data integrity, security, and/or reliability are not compromised), then it is feasible to wait to process the update and group it with other updates to the dispersed data source to improve efficiency of the DSN. With the updates grouped, the slices of the dispersed data source are retrieved once, the grouped updates are processed on the recovered data source, the multi-updated data source is re-encoded, and the multi-updated dispersed data source is stored in the DSN memory.

FIG. 10 is a logic diagram of a method for updating dispersed data sources in the DSN. The method begins at step 110 where a computing device (e.g., one or more of devices 12-20 of FIG. 1) determine that a dispersed data source is to be updated. The method continues at step 112 where the computing device determines whether the update to the dispersed data source can be delayed for a period of time. For example, the computing device determines whether the update has the potential to adversely affect the integrity, reliability, accuracy, and/or security of a related data object. If not, the update can be delayed for a few seconds to a few hours or more, depending the natures of the update, loading of the DSN, and/or availability of resources within the DSN. As another example, the computing device receives the update from a requesting computing device, wherein the requesting computing device indicates that the update can be delayed. As yet another example, the computing device interprets the update to determine that the update cannot be delayed. As a further example, the computing device determines to delay the update when input-output operations per second (IOPS) of the DSN is equal to or greater than an IOPS threshold (e.g., processing of the update is outweighed by the processing burden placed on the DSN at the current time). As a still further example, the computing device detects an update conflict for the dispersed data source.

When the update cannot be delayed, the method continues at step 114, where the computing device executes the update (e.g., retrieves the relevant slices, reconstructs the data source, makes the update to produce an updated data source, re-encodes the updated data source to produce an updated dispersed data source, and stores the updated dispersed data source in the DSN memory).

When the update to the dispersed data source can be delayed, the method continues at step 116 where the computing device determines whether another update is pending for the dispersed data source. The other pending update may be from the computing device or another computing device and it was determined that the other update could be delayed. When the other update is pending, the method continues at step 118 where the computing device determines whether processing efficiency of aggregating the update and the other update equals or exceeds an update processing efficiency threshold.

This is a sliding scale determination based on how long the updates have been delayed, the nature of the updates, the processing requirements to perform the updates, the processing load on the DSN, and/or other performance based factors. When the processing efficiency of aggregating the update and the other update equals or exceeds the update processing efficiency threshold, the method continues at step 120 where the computing device perform an aggregate update to the dispersed data source for the update and the other update to produce an aggregate updated dispersed data source. For example, the computing device retrieves the slices of the dispersed data source, reconstructs the data source, performs the updates on the data source sequentially and/or in parallel to produce an updated data source, re-encodes the updated data source, and sends the slices of the updated dispersed data source to the DSN memory for storage.

When another update is not pending, the method continues at step 122 where the computing device determines whether the period of time has expired. If yes, the method continues at step 124 where the computing device performs the update on the dispersed data source to produce an updated dispersed data source.

When the period of time has not expired, the method continues at step 126 where the computing device determines whether another computing device has a pending update for the dispersed data source. For example, the computing device sends a request to other computing devices to determine whether any of them have a pending update for the dispersed data source. As another example, the other computing device sends a message (direct or a broadcast) to the computing device regarding the other pending update. When the other computing device has the pending update, the method continues at step 128 where the computing device sends its update to the other computing device. The other computing device is now responsible for executed the update.

When another computing does not have another pending update, the method continues at step 130 where the computing device determines whether a second update to the dispersed data source has been received prior to expiration of the period of time. When the second update to the dispersed data source is received prior to expiration of the period of time, the method continues to step 118 where the computing device determines whether processing efficiency of aggregating the update and the second update equals or exceeds the update processing efficiency threshold.

When the processing efficiency of aggregating the update and the other update(s) does not equal or exceed the update processing efficiency threshold, the method continues at step 122 where the computing device determines whether the period of time has expired. If so, the method proceeds to step 124 where the computing device performs the aggregate updates on the dispersed data source.

It is noted that terminologies as may be used herein such as bit stream, stream, signal sequence, etc. (or their equivalents) have been used interchangeably to describe digital information whose content corresponds to any of a number of desired types (e.g., data, video, speech, audio, etc. any of which may generally be referred to as ‘data’).

As may be used herein, the terms “substantially” and “approximately” provides an industry-accepted tolerance for its corresponding term and/or relativity between items. Such an industry-accepted tolerance ranges from less than one percent to fifty percent and corresponds to, but is not limited to, component values, integrated circuit process variations, temperature variations, rise and fall times, and/or thermal noise. Such relativity between items ranges from a difference of a few percent to magnitude differences. As may also be used herein, the term(s) “configured to”, “operably coupled to”, “coupled to”, and/or “coupling” includes direct coupling between items and/or indirect coupling between items via an intervening item (e.g., an item includes, but is not limited to, a component, an element, a circuit, and/or a module) where, for an example of indirect coupling, the intervening item does not modify the information of a signal but may adjust its current level, voltage level, and/or power level. As may further be used herein, inferred coupling (i.e., where one element is coupled to another element by inference) includes direct and indirect coupling between two items in the same manner as “coupled to”. As may even further be used herein, the term “configured to”, “operable to”, “coupled to”, or “operably coupled to” indicates that an item includes one or more of power connections, input(s), output(s), etc., to perform, when activated, one or more its corresponding functions and may further include inferred coupling to one or more other items. As may still further be used herein, the term “associated with”, includes direct and/or indirect coupling of separate items and/or one item being embedded within another item.

As may be used herein, the term “compares favorably”, indicates that a comparison between two or more items, signals, etc., provides a desired relationship. For example, when the desired relationship is that signal 1 has a greater magnitude than signal 2, a favorable comparison may be achieved when the magnitude of signal 1 is greater than that of signal 2 or when the magnitude of signal 2 is less than that of signal 1. As may be used herein, the term “compares unfavorably”, indicates that a comparison between two or more items, signals, etc., fails to provide the desired relationship.

As may also be used herein, the terms “processing module”, “processing circuit”, “processor”, and/or “processing unit” may be a single processing device or a plurality of processing devices. Such a processing device may be a microprocessor, micro-controller, digital signal processor, microcomputer, central processing unit, field programmable gate array, programmable logic device, state machine, logic circuitry, analog circuitry, digital circuitry, and/or any device that manipulates signals (analog and/or digital) based on hard coding of the circuitry and/or operational instructions. The processing module, module, processing circuit, and/or processing unit may be, or further include, memory and/or an integrated memory element, which may be a single memory device, a plurality of memory devices, and/or embedded circuitry of another processing module, module, processing circuit, and/or processing unit. Such a memory device may be a read-only memory, random access memory, volatile memory, non-volatile memory, static memory, dynamic memory, flash memory, cache memory, and/or any device that stores digital information. Note that if the processing module, module, processing circuit, and/or processing unit includes more than one processing device, the processing devices may be centrally located (e.g., directly coupled together via a wired and/or wireless bus structure) or may be distributedly located (e.g., cloud computing via indirect coupling via a local area network and/or a wide area network). Further note that if the processing module, module, processing circuit, and/or processing unit implements one or more of its functions via a state machine, analog circuitry, digital circuitry, and/or logic circuitry, the memory and/or memory element storing the corresponding operational instructions may be embedded within, or external to, the circuitry comprising the state machine, analog circuitry, digital circuitry, and/or logic circuitry. Still further note that, the memory element may store, and the processing module, module, processing circuit, and/or processing unit executes, hard coded and/or operational instructions corresponding to at least some of the steps and/or functions illustrated in one or more of the Figures. Such a memory device or memory element can be included in an article of manufacture.

One or more embodiments have been described above with the aid of method steps illustrating the performance of specified functions and relationships thereof. The boundaries and sequence of these functional building blocks and method steps have been arbitrarily defined herein for convenience of description. Alternate boundaries and sequences can be defined so long as the specified functions and relationships are appropriately performed. Any such alternate boundaries or sequences are thus within the scope and spirit of the claims. Further, the boundaries of these functional building blocks have been arbitrarily defined for convenience of description. Alternate boundaries could be defined as long as the certain significant functions are appropriately performed. Similarly, flow diagram blocks may also have been arbitrarily defined herein to illustrate certain significant functionality.

To the extent used, the flow diagram block boundaries and sequence could have been defined otherwise and still perform the certain significant functionality. Such alternate definitions of both functional building blocks and flow diagram blocks and sequences are thus within the scope and spirit of the claims. One of average skill in the art will also recognize that the functional building blocks, and other illustrative blocks, modules and components herein, can be implemented as illustrated or by discrete components, application specific integrated circuits, processors executing appropriate software and the like or any combination thereof.

In addition, a flow diagram may include a “start” and/or “continue” indication. The “start” and “continue” indications reflect that the steps presented can optionally be incorporated in or otherwise used in conjunction with other routines. In this context, “start” indicates the beginning of the first step presented and may be preceded by other activities not specifically shown. Further, the “continue” indication reflects that the steps presented may be performed multiple times and/or may be succeeded by other activities not specifically shown. Further, while a flow diagram indicates a particular ordering of steps, other orderings are likewise possible provided that the principles of causality are maintained.

The one or more embodiments are used herein to illustrate one or more aspects, one or more features, one or more concepts, and/or one or more examples. A physical embodiment of an apparatus, an article of manufacture, a machine, and/or of a process may include one or more of the aspects, features, concepts, examples, etc. described with reference to one or more of the embodiments discussed herein. Further, from figure to figure, the embodiments may incorporate the same or similarly named functions, steps, modules, etc. that may use the same or different reference numbers and, as such, the functions, steps, modules, etc. may be the same or similar functions, steps, modules, etc. or different ones.

Unless specifically stated to the contra, signals to, from, and/or between elements in a figure of any of the figures presented herein may be analog or digital, continuous time or discrete time, and single-ended or differential. For instance, if a signal path is shown as a single-ended path, it also represents a differential signal path. Similarly, if a signal path is shown as a differential path, it also represents a single-ended signal path. While one or more particular architectures are described herein, other architectures can likewise be implemented that use one or more data buses not expressly shown, direct connectivity between elements, and/or indirect coupling between other elements as recognized by one of average skill in the art.

The term “module” is used in the description of one or more of the embodiments. A module implements one or more functions via a device such as a processor or other processing device or other hardware that may include or operate in association with a memory that stores operational instructions. A module may operate independently and/or in conjunction with software and/or firmware. As also used herein, a module may contain one or more sub-modules, each of which may be one or more modules.

As may further be used herein, a computer readable memory includes one or more memory elements. A memory element may be a separate memory device, multiple memory devices, or a set of memory locations within a memory device. Such a memory device may be a read-only memory, random access memory, volatile memory, non-volatile memory, static memory, dynamic memory, flash memory, cache memory, and/or any device that stores digital information. The memory device may be in a form a solid state memory, a hard drive memory, cloud memory, thumb drive, server memory, computing device memory, and/or other physical medium for storing digital information.

While particular combinations of various functions and features of the one or more embodiments have been expressly described herein, other combinations of these features and functions are likewise possible. The present disclosure is not limited by the particular examples disclosed herein and expressly incorporates these other combinations. 

What is claimed is:
 1. A method for execution by a computing device in a dispersed storage network (DSN), the method comprises: determining that a first dispersed data source of a plurality of dispersed data sources of the DSN is to be updated in a first update, wherein the first update requires retrieval of a set of encoded data slices from one or more regions in the DSN; determining whether the first update to the first dispersed data source of the plurality of dispersed data sources of the DSN can be delayed for a period of time; when the first update to the first dispersed data source can be delayed for the period of time: determining whether a second update is pending for the first dispersed data source, wherein the second update requires retrieval of at least some of the set of encoded data slices; when the second update is pending: determining a processing efficiency of aggregating the first update and the second update based on processing requirements to perform the first and second updates; and determining whether the determined processing efficiency of aggregating the first update and the second update equals or exceeds an update processing efficiency threshold; and when the processing efficiency of aggregating the first update and the second update equals or exceeds the update processing efficiency threshold: performing an aggregate update to the first dispersed data source for the first update and the second update to produce an aggregate updated first dispersed data source, wherein performing the aggregate update comprises retrieving the set of encoded data slices; and when the first update to the first dispersed data source cannot be delayed: processing the first update to produce an updated first dispersed data source, wherein the first update to produce the updated first dispersed data source includes retrieval of the set of encoded data slices.
 2. The method of claim 1 further comprises: when the second update is not pending, determining whether the period of time has expired; and when the period of time has expired, performing the first update on the first dispersed data source to produce the updated first dispersed data source.
 3. The method of claim 2 further comprises: when the period of time has not expired, determining whether another update to the first dispersed data source has been received prior to expiration of the period of time; when the other update to the first dispersed data source is received prior to expiration of the period of time, determining whether processing efficiency of aggregating the first update and the other update equals or exceeds the update processing efficiency threshold; and when the processing efficiency of aggregating the first update and the other update equals or exceeds the update processing efficiency threshold, performing an aggregate update to the first dispersed data source for the first update and the other update to produce a second aggregate updated first dispersed data source.
 4. The method of claim 1 further comprises: when the processing efficiency of aggregating the update and the second update does not equal or exceed the update processing efficiency threshold: determining whether the period of time has expired; and when the period of time has expired: performing the aggregate update to produce the aggregate updated first dispersed data source.
 5. The method of claim 1 further comprises: when the period of time has not expired: determining whether another computing device has a pending update for the first dispersed data source; and when the other computing device has the pending update for the first dispersed data source: sending, to the other computing device, the first update to the first dispersed data source for the other computing device to perform.
 6. The method of claim 1, wherein the first dispersed data source comprises one of: a data object divided into a plurality of data segments, wherein a data segment of the plurality of data segments is dispersed storage error encoded to produce the set of encoded data slices, wherein the set of encoded data slices is stored in a set of storage units of the DSN, and wherein the plurality of data segments is dispersed storage error encoded to produce a plurality of sets of encoded data slices; a set of slice names for the set of encoded data slices; metadata regarding the set of encoded data slices, wherein the metadata is dispersed storage error encoding into a set of encoded metadata slices and wherein the set of encoded metadata slices is stored in storage units of the DSN; a region header regarding a group of sets of encoded data slices of the plurality of sets of encoded data slices, wherein the group of sets of encoded data slices is stored in a DSN storage region within the set of storage units; and an index node of an index structure, wherein the index node includes attribute information to identify the set of encoded data slices.
 7. The method of claim 1, wherein the determining whether the first update to the first dispersed data source can be delayed for the period of time comprises one or more of: receiving the first update from a requesting computing device, wherein the requesting computing device indicates that the first update can be delayed; interpreting the first update to determine that the first update cannot be delayed; determining to delay the first update when input-output operations per second (IOPS) of the DSN is equal to or greater than an TOPS threshold; and detecting an update conflict for the first dispersed data source.
 8. A computer readable memory comprises: a first memory element that stores operational instructions that, when executed by a computing device of a dispersed storage network (DSN), causes the computing device to: determine that a first dispersed data source of a plurality of dispersed data sources of the DSN is to be updated in a first update, wherein the first update requires retrieval of a set of encoded data slices from one or more regions in the DSN; and determine whether the first update to the first dispersed data source of the plurality of dispersed data sources of the DSN can be delayed for a period of time; a second memory element that stores operational instructions that, when executed by the computing device, causes the computing device to: when the first update to the first dispersed data source can be delayed for the period of time: determine whether a second update is pending for the first dispersed data source, wherein the second update requires retrieval of at least some of the set of encoded data slices; when the second update is pending: determine a processing efficiency of aggregating the first update and the second update based on processing requirements to perform the first and second updates and a processing load on the DSN; and determine whether the processing efficiency of aggregating the first update and the second update equals or exceeds an update processing efficiency threshold; and when the processing efficiency of aggregating the first update and the second update equals or exceeds the update processing efficiency threshold: perform an aggregate update to the first dispersed data source for the first update and the second update to produce an aggregate updated first dispersed data source, wherein performing the aggregate update comprises retrieving the set of encoded data slices of the first dispersed data source, reconstructing the first data source, performing the first update and the second update on the first data source sequentially or in parallel to produce an updated first data source, and sending slices of the updated dispersed data source to the DSN memory for storage; and a third memory element that stores operational instructions that, when executed by the computing device, causes the computing device to: when the first update to the first dispersed data source cannot be delayed: process the first update to produce an updated first dispersed data source, wherein the first update to produce the updated first dispersed data source includes retrieval of the set of encoded data slices.
 9. The computer readable memory of claim 8 further comprises: a fourth memory element that stores operational instructions that, when executed by the computing device, causes the computing device to: when the second update is not pending, determine whether the period of time has expired; and when the period of time has expired, perform the first update on the first dispersed data source to produce the updated first dispersed data source.
 10. The computer readable memory of claim 9 further comprises: a fifth memory element that stores operational instructions that, when executed by the computing device, causes the computing device to: when the period of time has not expired, determine whether another update to the first dispersed data source has been received prior to expiration of the period of time; when the other update to the first dispersed data source is received prior to expiration of the period of time, determine whether processing efficiency of aggregating the first update and the other update equals or exceeds the update processing efficiency threshold; and when the processing efficiency of aggregating the first update and the other update equals or exceeds the update processing efficiency threshold, perform an aggregate update to the first dispersed data source for the first update and the other update to produce a second aggregate updated first dispersed data source.
 11. The computer readable memory of claim 8 further comprises: a fourth memory element that stores operational instructions that, when executed by the computing device, causes the computing device to: when the processing efficiency of aggregating the first update and the second update does not equal or exceed the update processing efficiency threshold, determine whether the period of time has expired; and when the period of time has expired, perform the aggregate update to produce the aggregate updated first dispersed data source.
 12. The computer readable memory of claim 8 further comprises: a fourth memory element that stores operational instructions that, when executed by the computing device, causes the computing device to: when the period of time has not expired, determine whether another computing device has a pending update for the first dispersed data source; and when the other computing device has the pending update for the first dispersed data source, send, to the other computing device, the first update to the first dispersed data source for the other computing device to perform.
 13. The computer readable memory of claim 8, wherein the first dispersed data source comprises one of: a data object divided into a plurality of data segments, wherein a data segment of the plurality of data segments is dispersed storage error encoded to produce the set of encoded data slices, wherein the set of encoded data slices is stored in a set of storage units of the DSN, and wherein the plurality of data segments is dispersed storage error encoded to produce a plurality of sets of encoded data slices; a set of slice names for the set of encoded data slices; metadata regarding the set of encoded data slices, wherein the metadata is dispersed storage error encoding into a set of encoded metadata slices and wherein the set of encoded metadata slices is stored in storage units of the DSN; a region header regarding a group of sets of encoded data slices of the plurality of sets of encoded data slices, wherein the group of sets of encoded data slices is stored in a DSN storage region within the set of storage units; and an index node of an index structure, wherein the index node includes attribute information to identify the set of encoded data slices.
 14. The computer readable memory of claim 8, wherein the determining whether the first update to the first dispersed data source can be delayed for the period of time comprises one or more of: receiving the first update from a requesting computing device, wherein the requesting computing device indicates that the first update can be delayed; interpreting the first update to determine that the first update cannot be delayed; determining to delay the first update when input-output operations per second (IOPS) of the DSN is equal to or greater than an TOPS threshold; and detecting an update conflict for the first dispersed data source.
 15. A computing device of a dispersed storage network (DSN) comprises: an interface; a memory; and a processing module operably coupled to the interface and the memory, wherein the processing module is operable to: determine that a first dispersed data source of a plurality of dispersed data sources of the DSN is to be updated in a first update, wherein the first update requires retrieval of a set of encoded data slices from one or more regions in the DSN; determine whether the first update to the first dispersed data source of the plurality of dispersed data sources of the DSN can be delayed for a period of time; when the first update to the first dispersed data source can be delayed for the period of time: determine whether a second update is pending for the first dispersed data source, wherein the second update requires retrieval of the set of encoded data slices; when the second update is pending: determine a processing efficiency of aggregating the first update and the second update based on processing requirements to perform the first and second updates; and determine whether the processing efficiency of aggregating the first update and the second update equals or exceeds an update processing efficiency threshold; and when the processing efficiency of aggregating the first update and the second update equals or exceeds the update processing efficiency threshold: perform an aggregate update to the first dispersed data source for the first update and the second update to produce an aggregate updated first dispersed data source; and when the first update to the first dispersed data source cannot be delayed: process the first update to produce an updated first dispersed data source, wherein the first update to produce the updated first dispersed data source includes retrieval of the set of encoded data slices.
 16. The computing device of claim 15, wherein the processing module is further operable to: when the second update is not pending, determine whether the period of time has expired; and when the period of time has expired, perform the first update on the first dispersed data source to produce the updated first dispersed data source.
 17. The computing device of claim 16, wherein the processing module is further operable to: when the period of time has not expired, determine whether another update to the first dispersed data source has been received prior to expiration of the period of time; when the other update to the first dispersed data source is received prior to expiration of the period of time: determine whether processing efficiency of aggregating the first update and the other update equals or exceeds the update processing efficiency threshold; and when the processing efficiency of aggregating the first update and the other update equals or exceeds the update processing efficiency threshold, perform an aggregate update to the first dispersed data source for the first update and the other update to produce a second aggregate updated first dispersed data source.
 18. The computing device of claim 15, wherein the determining the processing efficiency of aggregating the first update and the second update is further based on: how long the update and the second update have been delayed, a nature of the update and the second update, and a processing load on the DSN; and wherein the processing module is further operable to: when the processing efficiency of aggregating the first update and the second update does not equal or exceed the update processing efficiency threshold, determine whether the period of time has expired; and when the period of time has expired, perform the aggregate update to produce the aggregate updated first dispersed data source.
 19. The computing device of claim 15, wherein the processing module is further operable to: when the period of time has not expired, determine whether another computing device has a pending update for the first dispersed data source; and when the other computing device has the pending update for the first dispersed data source, send, to the other computing device via the interface, the first update to the first dispersed data source for the other computing device to perform.
 20. The computing device of claim 15, wherein the processing module is further operable to determine whether the first update to the first dispersed data source can be delayed for the period of time by one or more of: receiving the first update from a requesting computing device, wherein the requesting computing device indicates that the first update can be delayed; interpreting the first update to determine that the first update cannot be delayed; determining to delay the first update when input-output operations per second (IOPS) of a dispersed storage network is equal to or greater than an TOPS threshold; and detecting an update conflict for the first dispersed data source. 